On lattices of regular sets of natural integers closed under decrementation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Lattices of Regular Sets of Natural Integers Closed under Decrementation

We consider lattices of regular sets of non negative integers, i.e. of sets definable in Presbuger arithmetic. We prove that if such a lattice is closed under decrement then it is also closed under many other functions: quotients by an integer, roots, etc.

متن کامل

On Regular Generalized $delta$-closed Sets in Topological Spaces

In this paper a new class of sets called  regular generalized  $delta$-closed set (briefly rg$delta$-closed set)is introduced and its properties are studied. Several examples are provided to illustrate the behaviour of these new class of sets.

متن کامل

On Generalized Regular Closed Sets

The aim of this paper is to introduce the concept of generalized regular closed sets and study some of its properties . The corresponding topological space formed by the family of these sets is also studied. It may be noted that regular closed set doesn’t forms even a supra topological space. Various researchers had studied the concept of generalized closed sets and regular generalized closed s...

متن کامل

Lattices of Scott-closed sets

A dcpo P is continuous if and only if the lattice C(P ) of all Scottclosed subsets of P is completely distributive. However, in the case where P is a non-continuous dcpo, little is known about the order structure of C(P ). In this paper, we study the order-theoretic properties of C(P ) for general dcpo’s P . The main results are: (i) every C(P ) is C-continuous; (ii) a complete lattice L is iso...

متن کامل

Regular closed sets of permutations

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets to be enumerated by rational generating functions. As a consequence we give the first non-trivial examples of pattern closed sets of permutations all of whose closed subclasses ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2014

ISSN: 0020-0190

DOI: 10.1016/j.ipl.2013.11.013